Secrecy Transfer for Sensor Networks: from Random Graphs to Secure Random Geometric Graphs
نویسندگان
چکیده
Suppose n nodes with n0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at most r, the acquaintanceship between nodes form a random graph, while the physical communication links constitute a random geometric graph. To get a fully connected and secure graph, we introduce a secrecy transfer algorithm which combines the random graph and the random geometric graph via an introduction process to produce an acquaintanceship graph Gn,n0. We find that the maximum component of graph Gn,n0 transitions rapidly from small components to a giant component when n0 is larger than a threshold, the threshold is derived, and applications for sensor networks are presented. KeywordsRandom graph, Random geometric graph, Sensor networks, Security. INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS VOL. 6, NO. 1, FEBRUARY 2013
منابع مشابه
Random intersection graphs and their applications in security, wireless communication, and social networks
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assi...
متن کاملApplications of Random Intersection Graphs to Secure Sensor Networks – Connectivity Results
Random intersection graphs was introduced by SingerCohen [6]. These graphs have recently received considerable attention in the literature and been used in diverse applications [1,2,7–13]. In a general random intersection graph, each node is assigned a set of items in some random manner, and any two nodes establish an undirected edge in between if and only if they have at least a certain number...
متن کاملk-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes, which is known as the node fault model. In this paper, we investigate k-connectivity of random graphs in the node fault model by evaluating the network breakd...
متن کاملk-Connectivity of Random Key Graphs
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer– Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also been used in diverse application areas beyond secure sensor networks; e.g., cryptanalysis, social networks, and recommender systems. Formally, a random key...
متن کاملEfficient collection of sensor data via a new accelerated random walk
Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases ...
متن کامل